|
In mathematics, the Fibonacci numbers form a sequence defined recursively by: :''F''(0) = 0 :''F''(1) = 1 :''F''(''n'') = ''F''(''n''-1) + ''F''(''n''-2), for integer ''n'' > 1. That is, after two starting values, each number is the sum of the two preceding numbers. The Fibonacci sequence has been studied extensively and generalized in many ways, for example, by starting with other numbers than 0 and 1, by adding more than two numbers to generate the next number, or by adding objects other than numbers. ==Extension to negative integers== Using ''F''''n''-2 = ''Fn'' - ''F''''n''-1, one can extend the Fibonacci numbers to negative integers. So we get: ... -8, 5, -3, 2, -1, 1, 0, 1, 1, 2, 3, 5, 8, ... and ''F-n'' = -(-1)''n''''Fn''. See also Negafibonacci. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Generalizations of Fibonacci numbers」の詳細全文を読む スポンサード リンク
|